Solving the Generalized Symmetric Eigenvalue Problem using Tile Algorithms on Multicore Architectures
نویسندگان
چکیده
Hatem LTAIEF a,2, Piotr LUSZCZEK b, Azzam HAIDAR b and Jack DONGARRA b a KAUST Supercomputing Laboratory, Thuwal, Saudi Arabia E-mail: [email protected] b Innovative Computing Laboratory, University of Tennessee, Knoxville TN USA Email: luszczek,haidar,[email protected] c Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, Tennessee d School of Mathematics & School of Computer Science, University of Manchester
منابع مشابه
Parallel Two-Stage Hessenberg Reduction using Tile Algorithms for Multicore Architectures
This paper describes a parallel Hessenberg reduction in the context of multicore architectures using tile algorithms. The Hessenberg reduction is very often used as a pre-processing step in solving dense linear algebra problems, such as the standard eigenvalue problem. Although expensive, orthogonal transformations are accepted techniques and commonly used for this reduction because they guaran...
متن کاملTowards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile algorithms, has recently been introduced. Previous research has shown that it is possible to write efficient and scalable tile algorithms for performing a Cholesky factorization, a (pseudo) LU factorization, a QR facto...
متن کاملToward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem
Classical solvers for the dense symmetric eigenvalue problem suffer from the first step involving a reduction to tridiagonal form that is dominated by the cost of accessing memory during the panel factorization. The solution is to reduce the matrix to a banded form, which then requires the eigenvalues of the banded matrix to be computed. The standard D&C algorithm can be modified for this purpo...
متن کاملScheduling two-sided transformations using tile algorithms on multicore architectures
The objective of this paper is to describe, in the context of multicore architectures, three different scheduler implementations for the two-sided linear algebra transformations, in particular the Hessenberg and Bidiagonal reductions which are the first steps for the standard eigenvalue problems and the singular value decompositions respectively. State-of-the-art dense linear algebra softwares,...
متن کاملAccelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
We present a Hessenberg reduction (HR) algorithm for hybrid systems of homogeneous multicore with GPU accelerators that can exceed 25× the performance of the corresponding LAPACK algorithm running on current homogeneous multicores. This enormous acceleration is due to proper matching of algorithmic requirements to architectural strengths of the system’s hybrid components. The results described ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011